Computation of Boolean functions by randomized programs
نویسندگان
چکیده
منابع مشابه
On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting
We develop quantum fingerprinting technique for constructing quantum branching programs (QBPs), which are considered as circuits with an ability to use classical bits as control variables. We demonstrate our approach constructing optimal quantum ordered binary decision diagram (QOBDD) for MODm Boolean function. The construction of our technique also allows to extend the recent result of Ambaini...
متن کاملRepresentations of Monotone Boolean Functions by Linear Programs
We introduce the notion of monotone linear-programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results. 1. MLP circuits are superpolynomially stronger than monotone Boolean circuits. 2. MLP circuits are exponentially stronger than monotone span programs. 3. MLP circuits can be used to provide monotone feasibility in...
متن کاملFast computation of symmetries in Boolean functions
Symmetry detection in completely specified Boolean functions is important for several applications in logic synthesis, technology mapping, BDD minimization, and testing. This paper presents a new algorithm to detect four basic types of two-variable symmetries. The algorithm detects all pairs of symmetric variables in one pass over the shared BDD of the multi-output function. The worst-case comp...
متن کاملNonlinearity Computation for Sparse Boolean Functions
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the distances to linear functions is obtained. The special structure of these distances can be exploited to reduce the task of nonlinearity computation to solving ...
متن کاملComputation of Trigonometric Functions by the Systolic Implementation of the CORDIC Algorithm
Trigonometric functions are among the most useful functions in the digital signal processing applications. The design introduced in this paper computes the trigonometric functions by means of the systolic arrays. The method for computing these functions for an arbitrary angle, , is the CORDIC algorithm. A simple standard cell is used for the systolic array. Due to the fixed inputs, in some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00295-0